Error Exponent in Asymmetric Quantum Hypothesis Testing and Its Application to Classical-Quantum Channel coding
نویسنده
چکیده
Masahito Hayashi ERATO-SORST Quantum Computation and Information Project, Japan Science and Technology Agency, 201 Daini Hongo White Bldg. 5-28-3, Hongo, Bunkyo-ku, Tokyo 113-0033, Japan. Superrobust Computation Project, Information Science and Technology Strategic Core (21st Century COE by MEXT), Graduate School of Information Science and Technology, The University of Tokyo, 7-3-1, Hongo, Bunkyo-ku, Tokyo, 113-0033, Japan.
منابع مشابه
Quantum Sphere-Packing Bounds with Polynomial Prefactors
We study lower bounds on the optimal error probability in classical coding over classicalquantum channels at rates below the capacity, commonly termed quantum sphere-packing bounds. Winter and Dalai have derived such bounds for classical-quantum channels; however, the exponents in their bounds only coincide when the channel is classical. In this paper, we show that these two exponents admit a v...
متن کاملSome Remarks on Classical and Classical-Quantum Sphere Packing Bounds: Rényi vs. Kullback-Leibler
We review the use of binary hypothesis testing for the derivation of the sphere packing bound in channel coding, pointing out a key difference between the classical and the classical-quantum setting. In the first case, two ways of using the binary hypothesis testing are known, which lead to the same bound written in different analytical expressions. The first method historically compares output...
متن کاملMy title
In this work, we study the tradeoffs between the error probabilities of classical-quantum channels and the blocklength n when the transmission rates approach the channel capacity at a rate slower than 1/ √ n, a research topic known as moderate deviation analysis. We show that the optimal error probability vanishes under this rate convergence. Our main technical contributions are a tight quantum...
متن کاملA Low-rate Bound on the Reliability of a Quantum Discrete Memoryless Channel1
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel to its quantum counterpart. The key observation that we make is that the problem of bounding below the error exponent for a quantum channel relying on the class of stabilizer codes is equivalent to the problem of deriving error exponents for a certain symmetric classical cha...
متن کاملError Exponents in Quantum Hypothesis Testing
In the simple quantum hypothesis testing problem, upper bounds on the error probabilities are shown based on a key matrix inequality. Concerning the error exponents, the upper bounds lead to noncommutative analogues of the Chernoff bound and the Hoeffding bound, which are identical with the classical counter part if the hypotheses, composed of two density operators, are mutually commutative. Ou...
متن کامل